On Correspondences between Probabilistic First-Order and Description Logics

نویسندگان

  • Pavel Klinov
  • Bijan Parsia
  • Ulrike Sattler
چکیده

This paper analyzes the probabilistic description logic PSHIQ by looking at it as a fragment of probabilistic first-order logic with semantics based on possible worlds. We argue that this is an appropriate way of investigating its properties and developing extensions. We show how the previously made arguments about different types of first-order probabilistic semantics apply to P-SHIQ. This approach has advantages for the future of both P-SHIQ, which can further evolve by incorporating semantic theories developed for the full first-order case, and the first-order logic, for which very few interesting decidable fragments are currently known. The paper also presents a probabilistic logic P-SHIQ which addresses some of the identified limitations of P-SHIQ.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relationships Between Probabilistic Description and First-Order Logics

This paper analyzes the probabilistic description logic P-SHIQ as a fragment of first-order probabilistic logic (FOPL). P-SHIQ was suggested as a language that is capable of representing and reasoning about different kinds of uncertainty in ontologies, namely generic probabilistic relationships between concepts and probabilistic facts about individuals. However, some semantic properties of P-SH...

متن کامل

Probabilistic Description Logics for Subjective Uncertainty

We propose a family of probabilistic description logics (DLs) that are derived in a principled way from Halpern’s probabilistic first-order logic. The resulting probabilistic DLs have a two-dimensional semantics similar to temporal DLs and are well-suited for representing subjective probabilities. We carry out a detailed study of reasoning in the new family of logics, concentrating on probabili...

متن کامل

A Strong Correspondence between Description Logics and Open Logic Programming

This paper formally investigates the relationship between Open Logic Programming (OLP) and Description Logics (DL). A description logic is designed to represent two diierent forms of knowledge. A T-Box represents deenitional knowledge, i.e. deenitions for a set of concepts. An A-Box represents assertional knowledge about speciic domain objects. OLP is a declarative, terminological interpretatio...

متن کامل

Reasoning in many dimensions: uncertainty and products of modal logics

Description Logics (DLs) are a popular family of knowledge representation languages. They are fragments of first-order logic (FO) that combine high expressiveness with reasonable computational properties; in particular, most DLs are decidable. However, being based on first-order logic, they share also the shortcomings. One of these shortcomings is that DLs do not have built-in means to capture ...

متن کامل

Gibbs Sampling in Probabilistic Description Logics with Deterministic Dependencies

In many applications there is interest in representing both probabilistic and deterministic dependencies. This is especially the case in applications using Description Logics (DLs), where ontology engineering usually is based on strict knowledge, while there is also the need to represent uncertainty. We introduce a Markovian style of probabilistic reasoning in first-order logic known as Markov ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009